Polynomial Iterations to Roots of Algebraic Equations

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Solving algebraic equations in roots of unity

This paper is devoted to finding solutions of polynomial equations in roots of unity. It was conjectured by S. Lang and proved by M. Laurent that all such solutions can be described in terms of a finite number of parametric families called maximal torsion cosets. We obtain new explicit upper bounds for the number of maximal torsion cosets on an algebraic subvariety of the complex algebraic n-to...

متن کامل

Localization and Perturbations of Roots to Systems of Polynomial Equations

Michael Gil’ Department of Mathematics, Ben Gurion University of the Negev, P.O. Box 653, Beer-Sheva 84105, Israel Correspondence should be addressed to Michael Gil’, [email protected] Received 20 March 2012; Accepted 28 May 2012 Academic Editor: Andrei Volodin Copyright q 2012 Michael Gil’. This is an open access article distributed under the Creative Commons Attribution License, which permit...

متن کامل

Univariate polynomial solutions of algebraic difference equations

Contrary to linear difference equations, there is no general theory of difference equations of the form G(P (x − τ1), . . . , P (x − τs)) + G0(x)=0, with τi ∈ K, G(x1, . . . , xs) ∈ K[x1, . . . , xs] of total degree D ≥ 2 and G0(x) ∈ K[x], where K is a field of characteristic zero. This article is concerned with the following problem: given τi, G and G0, find an upper bound on the degree d of a...

متن کامل

extensions of some polynomial inequalities to the polar derivative

توسیع تعدادی از نامساوی های چند جمله ای در مشتق قطبی

15 صفحه اول

Combinatorics of Polynomial Iterations

A complete description of the iterated monodromy groups of postcritically finite backward polynomial iterations is given in terms of their actions on rooted trees and automata generating them. We describe an iterative algorithm for finding kneading automata associated with post-critically finite topological polynomials and discuss some open questions about iterated monodromy groups of polynomials.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Proceedings of the American Mathematical Society

سال: 1951

ISSN: 0002-9939

DOI: 10.2307/2032068